Discretization Based Heuristics for the Capacitated Multi-facility Weber Problem with Convex Polyhedral Barriers
نویسندگان
چکیده
منابع مشابه
Efficient Heuristics for Single-source Capacitated Multi- Facility Weber Problems
In this paper, a single-source capacitated multifacility location problem with rectilinear distance under unbalanced transportation constraints is studied. The problem is formulated as a mixed integer linear programming problem of which the objective function is the sum of nonlinear functions. An algorithm under decomposition approach combining with logic based techniques is developed. Using th...
متن کاملA Cross Entropy-based heuristic for the capacitated multi-source Weber problem with facility fixed cost
This paper investigates a capacitated planar location-allocation problem with facility fixed cost. A zonebased fixed cost which consists of production and installation costs is considered. A nonlinear and mixed integer formulation is first presented. A powerful three stage Cross Entropy meta-heuristic with novel density functions is proposed. In the first stage a covering location problem provi...
متن کاملThe multi-facility location-allocation problem with polyhedral barriers
In this paper we consider the problem of locating N new facilities with respect to M existing facilities in the plane and in the presence of polyhedral barriers. We assume that a barrier is a region where neither facility location nor traveling is permitted. For the resulting multi-dimensional mixed-integer optimization problem two different alternate location and allocation procedures are deve...
متن کاملA continuation approach for the capacitated multi-facility weber problem based on nonlinear SOCP reformulation
We propose a primal-dual continuation approach for the capacitated multifacilityWeber problem (CMFWP) based on its nonlinear second-order cone program (SOCP) reformulation. The main idea of the approach is to reformulate the CMFWP as a nonlinear SOCP with a nonconvex objective function, and then introduce a logarithmic barrier term and a quadratic proximal term into the objective to construct a...
متن کاملA Beam Search Heuristic for the Multi- commodity Capacitated Multi-facility Weber Problem
The Multi-Commodity Capacitated Multi-facility Weber Problem (MCMWP) is concerned with locating I capacitated facilities in the plane to satisfy the demand of J customers for K commodities with the minimum total transportation cost. The MCMWP is a non-convex optimization problem. Customer locations, demands and capacities for each commodity are known a priori. The transportation costs, which de...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: An International Journal of Optimization and Control: Theories & Applications (IJOCTA)
سال: 2017
ISSN: 2146-5703,2146-0957
DOI: 10.11121/ijocta.01.2018.00388